Expander flows, geometric embeddings and graph partitioning
نویسندگان
چکیده
منابع مشابه
Simultaneous Geometric Graph Embeddings
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be placed in the plane in such a way that for each graph the straight-line drawing is planar. We partially settle an open problem of Erten and Kobourov [5] by showing that even for two graphs the problem is NP-hard. We also...
متن کاملUpward Geometric Graph Embeddings into Point Sets
We study the problem of characterizing the directed graphs with an upward straightline embedding into every point set in general or in convex position. We solve two questions posed by Binucci et al. [Computational Geometry: Theory and Applications, 2010 ]. Namely, we prove that the classes of directed graphs with an upward straightline embedding into every point set in convex position and with ...
متن کاملGlobal graph kernels using geometric embeddings
Applications of machine learning methods increasingly deal with graph structured data through kernels. Most existing graph kernels compare graphs in terms of features defined on small subgraphs such as walks, paths or graphlets, adopting an inherently local perspective. However, several interesting properties such as girth or chromatic number are global properties of the graph, and are not capt...
متن کاملMultiway partitioning via geometric embeddings, orderings, and dynamic programming
AbstructThis paper presents effective algorithms for multiway partitioning. Confirming ideas originally due to Hall, we demonstrate that geometric embeddings of the circuit netlist can lead to high-quality k-way partitionings. The netlist embeddings are derived via the computation of d eigenvectors of the Laplacian for a graph representation of the netlist. As Hall did not specify how to partit...
متن کاملMulti-Way Partitioning Via Geometric Embeddings, Orderings, and Dynamic Programming
30 Acknowledgements We thank Pak K. Chan, Martine Schlag and Jason Zien for past research discussions, for the use of the LASO interface written by Martine Schlag, and for the use of their KP and SB codes. Ken D. Boese supplied the 3-Opt optimization code. Lars Hagen and Jen-Hsin Huang developed the ideas behind the partitioning-speciic net model. The anonymous reviewers provided many comments ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2009
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1502793.1502794